Utilities Init Routine Parameter Setup Optimization Driver NLPLIB Solver OPTIM
نویسنده
چکیده
The paper presents a Graphical User Interface (GUI) for nonlinear programming in Matlab. The GUI gives easy access to all features in the NLPLIB TB (NonLinear Programming LIBrary Toolbox); a set of Matlab solvers, test problems, graphical and computational utilities for unconstrained and constrained optimization, quadratic programming, unconstrained and constrained nonlinear least squares, box-bounded global optimization, global mixed-integer nonlinear programming, and exponential sum model tting. The GUI also runs the linear programming problems in the linear and discrete optimization toolbox OPERA TB. Both NLPLIB TB and OPERA TB are part of TOMLAB; an environment in Matlab for research and teaching in optimization. Presently, NLPLIB TB implements more than 25 solver algorithms, and it is possible to call solvers in the Math Works Optimization Toolbox. MEXle interfaces are developed for seven Fortran and C solvers, and others are easily added using the same type of interface routines. There are four ways to solve a problem: by a direct call to the solver routine or a call to a multi-solver driver routine, or interactively, using the Graphical User Interface or a menu system. The GUI may also be used as a preprocessor to generate Matlab code for stand-alone runs. A large set of standard test problems is implemented in TOMLAB. Furthermore, using MEXle interfaces, problems in the CUTE test problem data base and problems de ned in the AMPL modeling language can be solved.
منابع مشابه
Stochastic Perron for Stochastic Target Problems
In this paper, we adapt stochastic Perron’s method to analyze stochastic target problems in a jump diffusion setup, where the controls are unbounded. Since classical control problems can be analyzed under the framework of stochastic target problems (with unbounded controls), we use our results to generalize the results of Bayraktar and Sîrbu (SIAM J Control Optim 51(6):4274–4294, 2013) to probl...
متن کاملA performance experiment system supporting fast mapping of system issues
The most fruitful use of a performance model is to study deep properties of the system, and hypothetical situations that might lead to improved configurations or designs. This requires executing experiments on the model, which evaluate systematic changes. Parameter estimation methods also exploit search in a parameter space to fit a model to performance data. Estimation, sensitivity and optimiz...
متن کاملA Complete Solver for Constraint Games
1 Game Theory studies situations in which multiple agents having conflicting objectives have to reach a collective decision. The question of a compact representation language for agents utility function is of crucial importance since the classical representation of a n-players game is given by a n-dimensional matrix of exponential size for each player. In this paper we use the framework of Cons...
متن کاملOn the Generalized Lanczos Trust-Region Method
The so-called Trust-Region Subproblem gets its name in the trust-region method in optimization and also plays a vital role in various other applications. Several numerical algorithms have been proposed in the literature for solving small-to-medium size dense problems as well as for large scale sparse problems. The Generalized Lanczos Trust-Region (GLTR) method proposed by [Gould, Lucidi, Roma a...
متن کاملAn Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
In this paper we develop a long-step primal-dual infeasible path-following algorithm for convex quadratic programming (CQP) whose search directions are computed by means of a preconditioned iterative linear solver. We propose a new linear system, which we refer to as the augmented normal equation (ANE), to determine the primal-dual search directions. Since the condition number of the ANE coeffi...
متن کامل